#include <iostream>
#include "queue.h"
#include "tree.h"
using namespace std;

void BFSQueueTree(Tnode<double>* t){
	Queue<Tnode<double>*> q = Queue<Tnode<double>*>();
	q.Add(t);
}
int main(int argc, char const *argv[])
{
	double arr[10] = {4,7,2,0,3,8,1,6,5,9};
	Tnode<double>* root = NULL;
	Tree<double>* tree = NULL;
	for(int i = 0;i < 10;i++){
		if(i == 0){
			root = new Tnode<double>(arr[i]);
		}
		else{
			tree->Add(arr[i],root);
		}
	}
	//tree->Print(root);

	return 0;
}